Triangle method for constructing Zhegalkin polynomial: connection with Pascal's triangle
نویسندگان
چکیده
منابع مشابه
Constructing Hierarchies for Triangle Meshes
We present a method to produce a hierarchy of triangle meshes that can be used to blend different levels of detail in a smooth fashion. The algorithm produces a sequence of meshes 00, 01, 02, ..., 0n, where each mesh 0i can be transformed to mesh 0i+1 through a set of triangle-collapse operations. For each triangle, a function is generated that approximates the underlying surface in the area of...
متن کاملThe doubloon polynomial triangle
The doubloon polynomials are generating functions for a class of combinatorial objects called normalized doubloons by the compressed major index. They provide a refinement of the q-tangent numbers and also involve two major specializations: the Poupard triangle and the Catalan triangle.
متن کاملConstructing Hamiltonian Triangle Strips on Quadrilateral Meshes
Because of their improved numerical properties, quadrilateral meshes have become a popular representation for finite elements computations and computer animation. In this paper we address the problem of optimally representing quadrilateral meshes as generalized triangle strips (with one swap bit per triangle). This is important because 3D rendering hardware is optimized for rendering triangle m...
متن کاملAlternating Sums in the Hosoya Polynomial Triangle
The Hosoya polynomial triangle is a triangular arrangement of polynomials where each entry is a product of two polynomials. The geometry of this triangle is a good 1 tool to study the algebraic properties of polynomial products. In particular, we find closed formulas for the alternating sum of products of polynomials such as Fibonacci polynomials, Chebyshev polynomials, Morgan-Voyce polynomials...
متن کاملA Triangle-Triangle Intersection Algorithm
The intersection between 3D objects plays a prominent role in spatial reasoning, geometric modeling and computer vision. Detection of possible intersection between objects can be based on the objects’ triangulated boundaries, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross intersection and coplanar intersection. There is no single algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: System research and information technologies
سال: 2020
ISSN: 2308-8893,1681-6048
DOI: 10.20535/srit.2308-8893.2020.1.12